ON THE EXPRESSIVE POWER OF PLANNING FORMALISMS ConditionalEffects and Boolean Preconditions in the STRIPS Formalism
نویسنده
چکیده
The notion of “expressive power” is often used in the literature on planning. However, it is usually only used in an informal way. In this paper, we will formalize this notion using the “compilability framework” and analyze the expressive power of some variants of allowing for conditional effects and arbitrary Boolean formulae in preconditions. One interesting consequence of this analysis is that we are able to confirm a conjecture by Bäckström that preconditions in conjunctive normal form add to the expressive power of propositional . Further, we will show that with conditional effects is incomparable to with Boolean formulae as preconditions. Finally, we show that preconditions in conjunctive normal form do not add any expressive power once we have conditional effects.
منابع مشابه
On the Compilability and Expressive Power of Propositional Planning Formalisms
The recent approaches of extending the GRAPHPLAN algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of “expressive power” is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of “compilation schemes” between planning for...
متن کاملExpressive Equivalence of Planning Formalisms
A concept of expressive equivalence for planning formalisms based on polynomial transformations is de ned. It is argued that this de nition is reasonable and useful both from a theoretical and from a practical perspective; if two languages are equivalent, then theoretical results carry over and, more practically, we can model an application problem in one language and then easily use a planner ...
متن کاملCompilation Schemes: A Theoretical Tool for Assessing the Expressive Power of Planning Formalisms
The recent approaches of extending the graphplan algorithm to handle more expressive planning formalisms raise the question of what the formal meaning of \expressive power" is. We formalize the intuition that expressive power is a measure of how concisely planning domains and plans can be expressed in a particular formalism by introducing the notion of \compilation schemes" between planning for...
متن کاملModeling and Computation in Planning: Better Heuristics from More Expressive Languages
Most of the key computational ideas in planning have been developed for simple planning languages where action preconditions and goals are conjunctions of propositional atoms. Preconditions and goals that do not fit into this form are normally converted into it either manually or automatically. In this work, we show that this modeling choice hides important structural information, resulting in ...
متن کاملA Multi-Agent Extension of Hierarchical Task Network
Describing planning domains using a common formalism promotes greater reuse of research, allowing a fairer comparison between different approaches. Common planning formalisms for single-agent planning are already well established (e.g., PDDL, STRIPS, and HTN), but currently there is a shortage of multi-agent planning formalisms with clear semantics. In this paper, we propose a multi-agent exten...
متن کامل